A Linear Scalarization Proximal Point Method for Quasiconvex Multiobjective Minimization
نویسندگان
چکیده
منابع مشابه
A scalarization proximal point method for quasiconvex multiobjective minimization
In this paper we propose a scalarization proximal point method to solve multiobjective unconstrained minimization problems with locally Lipschitz and quasiconvex vector functions. We prove, under natural assumptions, that the sequence generated by the method is well defined and converges globally to a Pareto-Clarke critical point. Our method may be seen as an extension, for the non convex case,...
متن کاملA logarithmic-quadratic proximal point scalarization method for multiobjective programming
We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map F with respect to the lexicographic order on R and we add a variant of the logarithmquadratic regularization of Auslender, where the unconstrained variables in the domain of F are introduced on the quadratic term and ...
متن کاملInexact scalarization proximal methods for multiobjective quasiconvex minimization on Hadamard manifolds
In this paper we extend naturally the scalarization proximal point method to solve multiobjective unconstrained minimization problems, proposed by Apolinario et al.[1], from Euclidean spaces to Hadamard manifolds for locally Lipschitz and quasiconvex vector objective functions. Moreover, we present a convergence analysis, under some mild assumptions on the multiobjective function, for two inexa...
متن کاملConvergence of the Proximal Point Method for Quasiconvex Minimization
This paper extends the full convergence of the classic proximal point method to solve continuous quasiconvex minimization problems in Euclidian spaces. Under the assumption that the global minimizer set is nonempty we prove the full convergence of the sequence generated by the method to a certain generalized critical point of the problem.
متن کاملAn Extension of the Proximal Point Method for Quasiconvex Minimization
In this paper we propose an extension of the proximal point method to solve minimization problems with quasiconvex objective functions on the Euclidean space and the nonnegative orthant. For the unconstrained minimization problem, assumming that the function is bounded from below and lower semicontinuous we prove that iterations {x} given by 0 ∈ ∂̂(f(.)+(λk/2)||.−x||)(x) are well defined and if,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2019
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-019-01582-z